Bounded linear mappings of finite rank

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Definably Linear Groups of Finite Morley Rank

Introduction. Zilber’s original trichotomy conjecture proposed an explicit classification of all one-dimensional objects arising in model theory. At one point, classifying the simple groups of finite Morley rank was viewed as a subproblem whose affirmative answer would justify this conjecture. Zilber’s conjecture was eventually refuted by Hrushovski [9], and the classification of simple groups ...

متن کامل

Algorithms for linear groups of finite rank

Article history: Received 21 January 2013 Available online 16 July 2013 Communicated by Derek Holt

متن کامل

Linear groups of finite Morley rank

Zilber’s original trichotomy conjecture proposed an explicit classification of all one-dimensional objects arising in model theory. At one point, classifying the simple groups of finite Morley rank was viewed as a subproblem whose affirmative answer would justify this conjecture. Zilber’s conjecture was eventually refuted by Hrushovski [], and the classification of simple groups of finite Morle...

متن کامل

On the Finite Rank of Bounded Semi-infinite Hankel Operators

Bounded, semi-infinite Hankel matrices of finite rank over the space l of square-summable sequences occur frequently in classical analysis and engineering applications. The notion of finite rank often appears under different contexts and the literature is diverse. The first part of this paper reviews some elegant, classic criteria and establish connections among the various characterizations of...

متن کامل

Factoring Finite-rank Linear Functional Systems∗

By a finite-rank (linear functional) system, we mean a system of linear differential, shift and q-shift operators or, any mixture thereof, whose solution space is finite-dimensional. This poster attempts to develop an algorithm for factoring finite-rank systems into “subsystems” whose solution spaces are of lower dimension. This work consists of three parts: 1. using module-theoretic language t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Functional Analysis

سال: 1981

ISSN: 0022-1236

DOI: 10.1016/0022-1236(81)90025-2